Distributed Newest Vertex Bisection
نویسندگان
چکیده
Distributed adaptive conforming refinement requires multiple iterations of the serial refinement algorithm and global communication as the refinement can be propagated over several processor boundaries. We show bounds on the maximum number of iterations. The algorithm is implemented within the software package Dune-ALUGrid.
منابع مشابه
A Remark on Newest Vertex Bisection in Any Space Dimension
Dietmar Gallistl, Mira Schedensack and Rob P. Stevenson A Remark on Newest Vertex Bisection in Any Space Dimension Abstract:With newest vertex bisection, there is no uniform bound on the number of �-simplices that need to be re�ned to arrive at the smallest conforming re�nementT� of a conforming partitionT inwhich one simplex has been bisected. In this note, we show that the di�erence in levels...
متن کاملA Weak Compatibility Condition for Newest Vertex Bisection in any dimension
We define a weak compatibility condition for the Newest Vertex Bisection algorithm on simplex grids of any dimension and show that using this condition the iterative algorithm terminates successfully. Additionally we provide an O(n) algorithm that renumbers any simplex grid to fulfil this condition. Furthermore we conduct experiments to estimate the distance to the standard compatibility and al...
متن کامل30 Years of Newest Vertex Bisection
One aspect of adaptive mesh refinement in the finite element method for solving partial differential equations is the method by which elements are refined. In the early 1980’s the dominant method for refining triangles was the red-green algorithm of Bank and Sherman. The red refinements are the desired refinements, but will result in an incompatible mesh when used alone. The green refinements a...
متن کاملA Coarsening Algorithm on Adaptive Grids by Newest Vertex Bisection and Its Applications
In this paper, an efficient and easy-to-implement coarsening algorithm is proposed for adaptive grids obtained using the newest vertex bisection method in two dimemsions. The new coarsening algorithm does not require storing the binary refinement tree explicitly. Instead, the structure is implicitly contained in a special ordering of triangular elements. Numerical experiments demonstrate that t...
متن کاملOn 2D newest vertex bisection: Optimality of mesh-closure and H-stability of L2-projection
Newest vertex bisection (NVB) is a popular local mesh-refinement strategy for regular triangulations which consist of simplices. For the 2D case, we prove that the meshclosure step of NVB, which preserves regularity of the triangulation, is quasi-optimal and that the corresponding L-projection onto lowest-order Courant finite elements (P1-FEM) is always H-stable. Throughout, no additional assum...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Parallel Distrib. Comput.
دوره 104 شماره
صفحات -
تاریخ انتشار 2017